Uniformizing Ladder System Colorings and the Rectangle Refining Property
نویسندگان
چکیده
We investigate forcing notions with the rectangle refining property, which is stronger than the countable chain condition, and fragments of Martin’s Axiom for such forcing notions. We prove that it is consistent that every forcing notion with the rectangle refining property has precaliber א1 but MAא1 for forcing notions with the rectangle refining property fails.
منابع مشابه
On Iterated Forcing for Successors of Regular Cardinals
We investigate the problem of when ≤ λ–support iterations of < λ–complete notions of forcing preserve λ. We isolate a property — properness over diamonds — that implies λ is preserved and show that this property is preserved by λ–support iterations. Our condition is a relative of that presented in [1]; it is not clear if the two conditions are equivalent. We close with an application of our tec...
متن کاملLadder Systems on Trees
We formulate the notion of uniformization of colorings of ladder systems on subsets of trees. We prove that Suslin trees have this property and also Aronszajn trees in the presence of Martin’s Axiom. As an application we show that if a tree has this property, then every countable discrete family of subsets of the tree can be separated by a family of pairwise disjoint open sets. Such trees are t...
متن کاملRectangle-Free Colorings of Extremely Complex Grids Using 4 Colors
The topic of this paper is the rectangle-free coloring of grids using four colors which is equivalent to the edge coloring of complete bipartite graphs without complete monochromatic subgraphs K2,2. Despite a strong mathematical background it is not known whether rectangle-free 4-colorable grids exist for five large grid sizes. We present in this paper an approach that solves the most complex p...
متن کاملSkew Chromatic Index of Circular Ladder Graphs
Abstract. A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, an algorithm is determined for skew edge coloring of circular ladder graphs. Alsothe skew chromatic index of circular la...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کامل